OPTIMAL CONTROL OF AN IMPERFECTLY OBSERVED QUEUEING SYSTEM

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Control of a Two-Server Queueing System with Failures

We consider the problem of controlling a two-server Markovian queueing system with heterogeneous servers. The servers are differentiated by their service rates and reliability attributes (i.e., the slower server is perfectly reliable while the faster server is subject to random failures). The aim is to dynamically route customers at arrival, service completion, server failure, and server repair...

متن کامل

Optimal Control of a Queueing System with Three Heterogeneous Servers

We study the problem of optimally controlling a three server queueing system. Arriving customers join a single queue, which is served by three servers, 8 1 , 52 and 53. The servers are exponential, but of different rates. The total expected time a customer spends in the system is to be minimized. We show that the optimal policy can be characterized by three thresholds, m3,mb and mi, such that: ...

متن کامل

An optimal control problem for a engineering system

In this article, we apply this new method for solving an engineering systemwith initial and boundary conditions and integral criterion ,and we will usingdynamic programming as iteration for solving model.

متن کامل

development and implementation of an optimized control strategy for induction machine in an electric vehicle

in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...

15 صفحه اول

A framework for imperfectly observed networks

Model a network as an edge-weighted graph, where the (unknown) weight we of edge e indicates the frequency of observed interactions, and over time t we observe a Poisson(twe) number of interactions across edges e. How should we estimate some given statistic of the underlying network? This leads to wide-ranging and challenging problems, on which this article makes only partial progress.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of informatics and cybernetics

سال: 1993

ISSN: 0286-522X

DOI: 10.5109/13430